Spectral determination of graphs whose components are paths and cycles
نویسندگان
چکیده
منابع مشابه
Some Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملOn graphs whose spectral radius
The structure of graphs whose largest eigenvalue is bounded by 3 2 √ 2 (≈ 2.1312) is investigated. In particular, such a graph can have at most one circuit, and has a natural quipu structure.
متن کاملFinding simple paths and cycles in graphs
We describe a novel method, the method of random colorings, for finding simple paths and cycles of a specified length k in a graph G = (V,E). Using small bias probability spaces and families of perfect hash functions we can derandomize the randomized algorithms obtained using this method and obtain deterministic algorithms that establish the following new results: • For every fixed k, deciding ...
متن کاملFinding Paths and Cycles in Graphs
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish). Introduction Problem of path/cycle existence and finding is a big topic in Discrete Mathematics and Computer Science [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, and others]. This article is not a review but just another design. The design’s idea may be traced back ...
متن کاملHamiltonian Paths and Cycles in Planar Graphs
We examine the problem of counting the number of Hamiltonian paths and Hamiltonian cycles in outerplanar graphs and planar graphs, respectively. We give an O(nαn) upper bound and an Ω(αn) lower bound on the maximum number of Hamiltonian paths in an outerplanar graph with n vertices, where α ≈ 1.46557 is the unique real root of α = α + 1. For any positive integer n ≥ 6, we define an outerplanar ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.04.021